markov chain anticipation for the online traveling salesman problem by simulated annealing algorithm

Markov Chain Anticipation for the Online Traveling Salesman Problem by Simulated Annealing Algorithm

The arc costs are assumed to be online parameters of the network and decisions should be made while the costs of arcs are not known. The policies determine the permitted nodes and arcs to traverse and they are generally defined according to the departure nodes of the current policy nodes. In on-line created tours arc costs are not available for decision makers. The on-line traversed nodes are f...

Simulated Annealing applied to the Traveling Salesman Problem

A New Hybrid Parallel Simulated Annealing Algorithm for Travelling Salesman Problem with Multiple Transporters

In today’s competitive transportation systems, passengers search to find traveling agencies that are able to serve them efficiently considering both traveling time and transportation costs. In this paper, we present a new model for the traveling salesman problem with multiple transporters (TSPMT). In the proposed model, which is more applicable than the traditional versions, each city has diffe...

A new Simulated Annealing algorithm for the robust coloring problem

The Robust Coloring Problem (RCP) is a generalization of the well-known Graph Coloring Problem where we seek for a solution that remains valid when extra edges are added. The RCP is used in scheduling of events with possible last-minute changes and study frequency assignments of the electromagnetic spectrum. This problem has been proved as NP-hard and in instances larger than 30 vertices, meta-...

an effective ant colony algorithm for the traveling salesman problem

the traveling salesman problem (tsp) is a well-known combinatorial optimization problem and holds a central place in logistics management. the tsp has received much attention because of its practical applications in industrial problems. many exact, heuristic and metaheuristic approaches have been proposed to solve tsp in recent years. in this paper, a modified ant colony optimization (maco) is ...

Solving Traveling Salesman Problem Using Parallel Genetic Algorithm and Simulated Annealing

The traveling salesman problem (TSP) is to find a tour of a given number of cities (visiting each city exactly once and returning to the starting city) where the length of this tour is minimized. In this project, we implemented solutions to the traveling salesman problem using parallel genetic algorithm and simulated annealing, and compared the parallel performance and results of these two impl...